A Complete Bibliography of the LMS Journal of Computation and Mathematics
نویسنده
چکیده
#P [20]. (2× 2 ·G): 2 [160]. 1 [174]. 12 [190]. 13A [321]. 2 [154, 269, 216, 117, 317, 146, 172, 6, 51]. 3 [216, 166]. 30 [11]. 4 [124]. 47: 23 [341]. 5 [332]. 6 [276, 142]. 6560 [54]. 7 [354]. 8 [267]. F4(q) [143, 161]. a − 2 = c [211]. a − 2b = c [211]. An [85]. B [73]. C [264]. C3,4 [122]. d [198]. E6 [123]. E7(2) [306]. E8 [123, 147]. ` [295]. F16 [126]. Fi24 [132]. GF(2) [104]. GF(p) [369]. GL2(Qp) [249]. j [152]. J4 [196, 59]. K [148, 230]. K3 [271]. K = 3 [332]. L [263, 362, 189, 290]. λ [323]. M [173]. M22 [129]. M24 [146]. F2 [347]. Fpn [281]. Q [289]. Zp[[u]] [268]. PSL(2, p) [248]. PSL2(27) [251]. p [73, 173, 145, 186, 286, 340, 249, 255, 130, 346, 194]. pg = 0 [332]. ±23 [85]. (mod p) [239]. PSL(2, R) [151]. PSL2(13) [321]. Sn [85]. SL2 [126]. SL2(R) [269]. θ [206, 243]. U7 [209]. W [174]. X0(125) [68]. X0(5) [87]. X0(N) [164]. Yn(p) [346]. Z [96].
منابع مشابه
The Wavelet Transform-Domain LMS Adaptive Filter Algorithm with Variable Step-Size
The wavelet transform-domain least-mean square (WTDLMS) algorithm uses the self-orthogonalizing technique to improve the convergence performance of LMS. In WTDLMS algorithm, the trade-off between the steady-state error and the convergence rate is obtained by the fixed step-size. In this paper, the WTDLMS adaptive algorithm with variable step-size (VSS) is established. The step-size in each subf...
متن کامل4-Prime cordiality of some classes of graphs
Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of G if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1....
متن کاملConstructions of antimagic labelings for some families of regular graphs
In this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.
متن کاملA duality between LM-fuzzy possibility computations and their logical semantics
Let X be a dcpo and let L be a complete lattice. The family σL(X) of all Scott continuous mappings from X to L is a complete lattice under pointwise order, we call it the L-fuzzy Scott structure on X. Let E be a dcpo. A mapping g : σL(E) −> M is called an LM-fuzzy possibility valuation of E if it preserves arbitrary unions. Denote by πLM(E) the set of all LM-fuzzy possibility valuations of E. T...
متن کاملSharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs
In $1994,$ degree distance of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the multiplicative version of degree distance and multiplicative ver...
متن کامل